Optimal modulation for known interference
نویسندگان
چکیده
منابع مشابه
Capacity of Known Interference Channel
In this paper, we investigate the capacity of known interference channel, where the receiver knows the interference data but not the channel gain of the interference data. We first present a tight upper bound for the capacity of this knowninterference channel. After that, we obtain the achievable rate of the channel with a blind known interference cancellation (BKIC) scheme in closed form. We p...
متن کاملOptimal embedding of known symbols for OFDM
The problem of placing known symbols optimally for OFDM is considered. The channel is assumed to be quasi-static with a finite impulse response. Under the assumption that neither the transmitter and receiver know the channel, we optimize the training by maximizing a lower bound of the mutual information. It is shown that the lower bound is maximized by placing the known symbols periodically. Op...
متن کاملThe Capacity of Known Interference Channel (updated)
In this paper, we investigate the capacity of known interference channel, where the receiver knows the interference data but not the channel gain of the interference data. We first derive a tight upper bound for the capacity of this known-interference channel. After that, we obtain an achievable rate of the channel with a blind known interference cancellation (BKIC) scheme in closed form. We pr...
متن کاملApproaching the Dirty Paper Limit for Canceling Known Interference
Costa’s “writing on dirty paper”–channel model offers an information theoretic framework for precoding techniques for canceling arbitrary known interference. Using lattice strategies and MMSE scaling, lossless precoding is theoretically possible at any SNR. Following this approach, we report an end-to-end coding realization of a system materializing a significant portion of the promised gains. ...
متن کاملCoding schemes for the binary symmetric channel with known interference
We consider a binary symmetric channel with additive binary interference known to the transmitter but unknown to the receiver. Depending on whether the interference signal is known noncausally or causally, this channel falls in the cases studied by Gel’fand and Pinsker and by Shannon, respectively, for which coding theorems and single-letter capacity expressions are known. In this work we prese...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2008
ISSN: 0090-6778,1558-0857
DOI: 10.1109/tcomm.2008.060382